Linearity testing with entangled provers
نویسنده
چکیده
We first recall the definition of the linearity test, and give a brief proof of its soundness for the case of classical players, in Section 1. In Section 2 we give a “beginner’s introduction” to the quantum formalism used to describe entangled players. In Section 3 we state the “entangledprover linearity test”, taking the opportunity to explain some of the challenges that arise in the analysis of entangled games. Finally, in Section 3.2 we give a proof of the soundness of that test, emphasizing the important tools and techniques that it makes use of.
منابع مشابه
Positivstellensatz, SDPs and Entangled Games
Today we are going to talk about an infinite hierarchy of semidefinite programmings which attempts to approximate the entangled value of multi-prover games [1]. This work is based on a recent result called non-commutative Positivstellensatz [2] about the representation of positive polynomials. In a one-round two-prover cooperative game, a verifier asks questions to two provers, Alice and Bob, w...
متن کاملTwo-player entangled games are NP-hard
We show that the maximum success probability of players sharing quantum entanglement in a twoplayer game with classical questions of logarithmic length and classical answers of constant length is NP-hard to approximate to within constant factors. As a corollary, the inclusion NEXP ⊆ MIP∗, first shown in [IV12] with three provers, holds with two provers only. The proof is based on a simpler, imp...
متن کاملThe Unique Games Conjecture with Entangled Provers is False
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ constraints (i.e., permutations), the value of the game can be well approximated by a semidefinite program. Essentially the only algorithm known previously was for the special case of binary answers, as follows from the work of ...
متن کاملSpatial Isolation Implies Zero Knowledge Even in a Quantum World
Zero knowledge plays a central role in cryptography and complexity. The seminal work of Ben-Or et al. (STOC 1988) shows that zero knowledge can be achieved unconditionally for any language in NEXP, as long as one is willing to make a suitable physical assumption: if the provers are spatially isolated, then they can be assumed to be playing independent strategies. Quantum mechanics, however, tel...
متن کاملar X iv : 0 70 4 . 29 03 v 2 [ qu an t - ph ] 2 1 N ov 2 00 7 Entangled games are hard to approximate
We establish the first hardness results for the problem of computing the value of one-round games played by a verifier and a team of provers who can share quantum entanglement. In particular, we show that it is NP-hard to approximate within an inverse polynomial the value of a one-round game with (i) quantum verifier and two entangled provers or (ii) classical verifier and three entangled prove...
متن کامل